Efficient Broadcast from Trapdoor Functions
نویسندگان
چکیده
A b s tra c t. W e present a novel schem e o f broadcast encryption that is suitable for broadcast servers such as pay TV services. T he important feature o f our schem e is that the length o f a broadcast string in our schem e is independent o f the num ber o f receivers in the system ; hence it is suitable fo r large groups. O ur schem e is based on a trapdoor encryption technique under the R SA assum ption. We also describe a variant of o u r schem e w hich provides stronger security.
منابع مشابه
Hybrid commitments and their applications to zero-knowledge proof systems
We introduce the notion of hybrid trapdoor commitment schemes. Intuitively a hybrid trapdoor commitment scheme is a primitive which can be either an unconditionally binding commitment scheme or a trapdoor commitment scheme depending on the distribution of commitment parameters. Moreover, such two possible distributions are computationally indistinguishable. Hybrid trapdoor commitments are relat...
متن کاملSecure, Efficient and Practical Key Management Scheme in the Complete-Subtree Method
The complete subtree (CS) method is one of the most well-known broadcast encryptions which do not enforce the receivers to keep “online.” This paper is to reduce the size of secret information which must be stored in a terminal of the method. In the original CS method, the size of the secret information increases as the number of terminals increases. It is shown in this paper that, by making us...
متن کاملLossy Trapdoor Functions from Smooth Homomorphic Hash Proof Systems
In STOC ’08, Peikert and Waters introduced a powerful new primitive called Lossy Trapdoor Functions (LTDFs). Since their introduction, lossy trapdoor functions have found many uses in cryptography. In the work of Peikert and Waters, lossy trapdoor functions were used to give an efficient construction of a chosen-ciphertext secure (IND-CCA2) cryptosystem. Lossy trapdoor functions were then shown...
متن کاملEfficient Trapdoor Hash Functions for Digital Signatures
By appending some bits to the original signature, a trapdoor hash function converts any signature scheme into secure signature scheme with very efficient online computation. Many of them have been proposed. The paper presents three new trapdoor hash functions with promotion in offline computation, online computation, appended bits, and the size of trapdoor key (but with longer public key). Whil...
متن کاملGeneral Construction of Chameleon All-But-One Trapdoor Functions
Lossy trapdoor functions enable black-box construction of public key encryption (PKE) schemes secure against chosen-ciphertext attack [18]. Recently, a more efficient black-box construction of public key encryption was given in [13] with the help of chameleon all-but-one trapdoor functions (ABO-TDFs). In this paper, we propose a black-box construction for transforming any ABO-TDFs into chameleo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005